NP-Completeness of Minimal Width Unordered Tree Layout
نویسندگان
چکیده
منابع مشابه
NP-Completeness of Minimal Width Unordered Tree Layout
Tree layout has received considerable attention because of its practical importance. Arguably the most common drawing convention is the (ordered) layered tree convention for rooted trees in which the layout is required to preserve the relative order of a node’s children. However, in some applications preserving the ordering of children is not important, and considerably more compact layout can ...
متن کاملNP - Completeness of some Tree - ClusteringProblemsF
A graph is a tree of paths (cycles), if its vertex set can be partitioned into clusters, such that each cluster induces a simple path (cycle), and the clusters form a tree. Our main result states that the problem whether or not a given graph is a tree of paths (cycles) is NP-complete. Moreover, if the length of the paths (cycles) is bounded by a constant, the problem is in P.
متن کاملNP-Completeness of Some Tree-Clustering Problems
A graph is a tree of paths (cycles), if its vertex set can be partitioned into clusters, such that each cluster induces a simple path (cycle), and the clusters form a tree. Our main result states that the problem whether or not a given graph is a tree of paths (cycles) is NP-complete. Moreover, if the length of the paths (cycles) is bounded by a constant, the problem is in P.
متن کاملLayout of Graphs with Bounded Tree-Width
A queue layout of a graph consists of a total order of the vertices, and a partition of the edges into queues, such that no two edges in the same queue are nested. The minimum number of queues in a queue layout of a graph is its queue-number. A threedimensional (straight-line grid) drawing of a graph represents the vertices by points in Z and the edges by non-crossing line-segments. This paper ...
متن کاملA Data-Parallel Algorithm for Minimum-Width Tree Layout
The tree-layout problem is to compute the coordinates of nodes of a tree so that the tree, when drawn on a piece of paper, appeals to human understanding. The tree-layout problem, which seems inherently sequential at the first glance, can be solved with a data-parallel algorithm. It takes O (height * log width ) time on width processors when proper communication links between processors are ava...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2004
ISSN: 1526-1719
DOI: 10.7155/jgaa.00093